Two statements of the Duggan-Schwartz theorem
نویسنده
چکیده
The Duggan-Schwartz theorem [Duggan and Schwartz, 1992] is a famous result concerning strategy-proof social choice correspondences, often stated as “A social choice correspondence that can be manipulated by neither an optimist nor a pessimist has a weak dictator”. However, this formulation is actually due to Taylor [2002], and the original theorem, at face value, looks rather different. In this note we show that the two are in fact equivalent.
منابع مشابه
On the equivalence of the HEX game theorem and the Duggan-Schwartz theorem for strategy-proof social choice correspondences
Gale [D. Gale, The game of HEX and the Brouwer fixed-point theorem, American Mathematical Monthly 86 (1979) 818–827] has shown that the so called HEX game theorem that any HEX game has one winner is equivalent to the Brouwer fixed point theorem. In this paper we will show that under some assumptions about marking rules of HEX games, the HEX game theorem for a 6 · 6 HEX game is equivalent to the...
متن کاملManipulability of consular election rules
The Gibbard-Satterthwaite theorem is a cornerstone of social choice theory, stating that an onto social choice function cannot be both strategy-proof and non-dictatorial if the number of alternatives is at least three. The Duggan-Schwartz theorem proves an analogue in the case of set-valued elections: if the function is onto with respect to singletons, and can be manipulated by neither an optim...
متن کاملStrategic manipulability without resoluteness or shared beliefs: Gibbard-Satterthwaite generalized
The Gibbard-Satterthwaite Theorem on the manipulability of socialchoice rules assumes resoluteness: there are no ties, no multi-member choice sets. Generalizations based on a familiar lottery idea allow ties but assume perfectly shared probabilistic beliefs about their resolution. We prove a more straightforward generalization that assumes almost no limit on ties or beliefs about them.
متن کاملA constructive view on ergodic theorems
Let T be a positive L1-L∞ contraction. We prove that the following statements are equivalent in constructive mathematics. 1. The projection in L2 on the space N : = cl{x−T x: x∈L2} exists; 2. The sequence (T n)n∈N Cesàro-converges in the L2 norm; 3. The sequence (T n)n∈N Cesàro-converges almost everywhere. Thus, we find necessary and sufficient conditions for the Mean Ergodic Theorem and the Du...
متن کاملA computational model and convergence theorem for rumor dissemination in social networks
The spread of rumors, which are known as unverified statements of uncertain origin, may threaten the society and it's controlling, is important for national security councils of countries. If it would be possible to identify factors affecting spreading a rumor (such as agents’ desires, trust network, etc.) then, this could be used to slow down or stop its spreading. Therefore, a computational m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1611.07105 شماره
صفحات -
تاریخ انتشار 2016